Software for Quantifier Elimination in Propositional Logic
نویسندگان
چکیده
We consider the problem of Quantifier Elimination (QE): given a Boolean CNF formula F where some variables are existentially quantified, find a logically equivalent quantifier-free CNF formula. This problem can be solved by finding a set of clauses containing only free variables such that adding this set of clauses to F makes all of the clauses of F containing quantified variables redundant. To solve the QE problem we developed a tool that handles a more general problem called partial QE. Our tool generates a set of clauses that when added to F render a specified subset of clauses with quantified variables redundant. In particular, if the specified subset contains all the clauses with quantified variables, our tool performs QE.
منابع مشابه
Boolean Quantification in a First-Order Context
We establish a framework to integrate propositional logic with first-order logic. This is done in such a way that it optionally appears either as first-order logic over a Boolean algebra or as propositional logic including Boolean quantification. We describe and prove complexity bounds for extended quantifier elimination by virtual substitution for our theory. This extended quantifier eliminati...
متن کاملDon’t-Care Computation using k-clause Approximation
Computation of the satisfiability and observability care sets for a sub-circuit in a Boolean network is essentially a problem of quantifier elimination in propositional logic. In this paper, we introduce a method of approximate quantifier elimination that computes the strongest over-approximation expressible using clauses of a given length. The method uses a Boolean satisfiability solver in a m...
متن کاملComputing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quantifier elimination techniques. The efficacy of the approach is demonstrated by using the techniques to compute snc’s and wsc’s for use in agent communication applications, theory approximation and generation of abductiv...
متن کاملThe Boolean Solution Problem from the Perspective of Predicate Logic (Abstract)
Finding solution values for unknowns in Boolean equations was, along with second-order quantifier elimination, a principal reasoning mode in the Algebra of Logic of the 19th century. Schröder [19] investigated it as Auflösungsproblem (solution problem). It is closely related to the modern notion of Boolean unification. For a given formula that contains unknowns formulas are sought such that aft...
متن کاملProof Theory for First Order Lukasiewicz Logic
An approximate Herbrand theorem is proved and used to establish Skolemization for first-order Łukasiewicz logic. Proof systems are then defined in the framework of hypersequents. In particular, extending a hypersequent calculus for propositional Łukasiewicz logic with usual Gentzen quantifier rules gives a calculus that is complete with respect to interpretations in safe MV-algebras, but lacks ...
متن کامل